An Application of the Deutsch-Jozsa Algorithm to Formal Languages and the Word Problem in Groups

نویسندگان

  • Michael Batty
  • Andrea Casaccino
  • Andrew J. Duncan
  • Sarah Rees
  • Simone Severini
چکیده

We adapt the Deutsch-Jozsa algorithm to the context of formal language theory. Specifically, we use the algorithm to distinguish between trivial and nontrivial words in groups given by finite presentations, under the promise that a word is of a certain type. This is done by extending the original algorithm to functions of arbitrary length binary output, with the introduction of a more general concept of parity. We provide examples in which properties of the algorithm allow to reduce the number of oracle queries with respect to the deterministic classical case. This has some consequences for the word problem in groups with a particular kind of presentation. 1 The Deutsch-Jozsa Algorithm and Formal Languages We apply a direct generalization of the Deutsch-Jozsa algorithm to the context of formal language theory. More particularly, we extend the algorithm to distinguish between trivial and nontrivial words in groups given by finite presentations, under the promise that a word is of a certain type. For background information, we refer the reader to [1] and [2]. The Deutsch-Jozsa algorithm concerns maps f : {0, 1}n −→ {0, 1}, which we may think of as words of length 2 in a two-letter alphabet. Instead, let us consider words of length 2 in a four-letter alphabet A = {a, b, c, d}. We identify the letters with binary strings of length 2: a ↔ 00, b ↔ 01, c ↔ 10 and d ↔ 11. In this way we can look at words of length 2 as in one-to-one correspondence with maps f : {0, 1}n −→ {00, 01, 10, 11}. First, consider the case n = 1, that is when the words have length 2. As with the standard formulation of the Deutsch-Jozsa algorithm, the promise will be vacuous in this case.We use the quantum circuit represented below. The circuit essentially implements the Deutsch’s algorithm, but with input |11〉 rather than |1〉: Corresponding author. Y. Kawano and M. Mosca (Eds.): TQC 2008, LNCS 5106, pp. 57–69, 2008. c © Springer-Verlag Berlin Heidelberg 2008

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Application of the Deutsch-Josza Algorithm to Formal Languages and the Word Problem in Groups

We adapt the Deutsch-Josza algorithm to the context of formal language theory. Specifically, we use the algorithm to distinguish between trivial and nontrivial words in groups given by finite presentations, under the promise that a word is of a certain type. This is done by extending the original algorithm to functions of arbitrary length binary output and with the introduction of a more genera...

متن کامل

Broken promises and quantum algorithms

In the black-box model, promise problems are the only ones that admit a quantum exponential speedup over the best classical algorithm in terms of query complexity. The most prominent example of this is the Deutsch-Jozsa algorithm. More recently, Wim van Dam put forward an algorithm for unstructured problems (ie, those without a promise). We consider the Deutsch-Jozsa algorithm with a less restr...

متن کامل

Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms

A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch–Jozsa and Simon’s problem, both efficiently solvable on a quantum Turing machine, and both believed to lack ...

متن کامل

nuclear-magnetic resonance quantum computation

We offer an improved method for using a nuclear-magnetic-resonance quantum computer (NMRQC) to solve the Deutsch-Jozsa problem. Two known obstacles to the application of the NMRQC are exponential diminishment of density-matrix elements with the number of bits, threatening weak signal levels, and the high cost of preparing a suitable starting state. A third obstacle is a heretofore unnoticed res...

متن کامل

Extending the Promise of the Deutsch–jozsa–høyer Algorithm for Finite Groups

Høyer has given a generalisation of the Deutsch–Jozsa algorithm which uses the Fourier transform on a group G which is (in general) non-Abelian. His algorithm distinguishes between functions which are either perfectly balanced (m-to-one) or constant, with certainty, and using a single quantum query. Here, we show that this algorithm (which we call the Deutsch–Jozsa–Høyer algorithm) can in fact ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008